Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

نویسنده

  • Mauro Mezzini
چکیده

A set of edges of a hypergraph H is an algebraic set if its characteristic vector can be expressed as a linear combination of rows of the (node-edge) incidence matrix of H. Recently it was proven that deciding whether or not a given edge-set of H contains a non-empty algebraic set is an NP complete problem. In this paper we give a linear time algorithm to decide if a given edge-set contains a non-empty algebraic set when the hypergraph is a graph. Article Type Communicated by Submitted Revised Regular paper L. Arge November 2005 January 2007 M. Mezzini, Nonempty Algebraic Subsets, JGAA, 11(1) 239–257 (2007) 240

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence Results of best Proximity Pairs for a Certain Class of Noncyclic Mappings in Nonreflexive Banach Spaces Polynomials 

Introduction Let  be a nonempty subset of a normed linear space . A self-mapping  is said to be nonexpansive provided that  for all . In 1965, Browder showed that every nonexpansive self-mapping defined on a nonempty, bounded, closed and convex subset of a uniformly convex Banach space , has a fixed point. In the same year, Kirk generalized this existence result by using a geometric notion of ...

متن کامل

dominating subset and representation graph on topological spaces

Let a topological space. An intersection graph on a topological space , which denoted by ‎ , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of  and graph properties of ‎  are investigated. Also some classifications and representations for the graph ...

متن کامل

Finite groups admitting a connected cubic integral bi-Cayley graph

A graph   is called integral if all eigenvalues of its adjacency matrix  are integers.  Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$.  In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.

متن کامل

Nonexpansive mappings on complex C*-algebras and their fixed points

A normed space $mathfrak{X}$ is said to have the fixed point property, if for each nonexpansive mapping $T : E longrightarrow E $ on a nonempty bounded closed convex subset $ E $ of $ mathfrak{X} $ has a fixed point. In this paper, we first show that if $ X $ is a locally compact Hausdorff space then the following are equivalent: (i) $X$ is infinite set, (ii) $C_0(X)$ is infinite dimensional, (...

متن کامل

Well-dispersed subsets of non-dominated solutions for MOMILP ‎problem

This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Graph Algorithms Appl.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2007